Electronic Notes in Theoretical Computer Science Security and Rewriting Techniques
نویسنده
چکیده
Language-based security approaches to access control and information flow control must at some point rely on a language for expressing policies. However there will in general be several choices for the correct policy language for any given application, and several choices for the implementation of a policy language in a given domain. This article considers an approach to implementing the policy language at the application level, relying on trusted cryptographic libraries whose interface security guarantees are used to verify the correctness of the policy language implementation.
منابع مشابه
Rewriting logic: roadmap and bibliography
Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30–June 3, 1994, Selected Papers, Lecture Notes in Computer Science, Vol. 906, Springer, Berlin, 1995, pp. 351–367. [201] M. Leucker, T. Noll, Rewriting logic as a framework for generic veri9cation tools, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Jap...
متن کاملAbstract rewriting logic parameterized by a formal system
rewriting logic parameterized by a formal system Marc Aiguier École Centrale Paris Laboratoire de Mathématiques Appliqués aux Systèmes (MAS) Grande Voie des Vignes F-92295 Châtenay-Malabry [email protected] & Programme d’Épignomique 523, Place des Terrasses de l’Agora F-91025 Evry [email protected] Diane Bahrami CEA-LIST Saclay F-91191 Gif sur Yvette Cedex diane.bahrami@ce...
متن کاملElectronic Notes in Theoretical Computer Science 7 th International Workshop on Rewriting Logic and its Applications
Membrane systems represent a new model of computation involving parallel application of rules, communication between membranes and dissolving. Since rewriting logic is a general framework for concurrent systems, we connect it with the operational semantics of membrane systems. We use a new representation given by register membranes which are able to express the evolution involving rules with pr...
متن کاملConvergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
Citation for published version (APA): Bahr, P. (2013). Convergence in infinitary term graph rewriting systems is simple (extended abstract). In R. Echahed, & D. Plump (Eds.), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013 (pp. 17-28). Open Publishing Association. Electronic Proceedings in Theoretical Computer Science, Vol.. 110, DOI: 10.4...
متن کاملRelating state-based and process-based concurrency through linear logic (full-version)
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic. The starting poin...
متن کامل